Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
نویسندگان
چکیده
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40 -approximation algorithm for ∆-Max-ATSP and a 34 -approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle covers to directed problems.
منابع مشابه
Approximating Multi-criteria Max-TSP
The traveling salesman problem (TSP) is one of the most fundamental problems in combinatorial optimization. Given a graph, the goal is to find a Hamiltonian cycle of minimum or maximum weight. We consider finding Hamiltonian cycles of maximum weight (Max-TSP). An instance of Max-TSP is a complete graph G = (V,E) with edge weights w : E → N. The goal is to find a Hamiltonian cycle of maximum wei...
متن کاملMulti-Criteria Traveling Salesman Problems
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کاملImproved Inapproximability Results for the Shortest Superstring and the Bounded Metric TSP
We present a new method for proving explicit approximation lower bounds for the Shortest Superstring problem, the Maximum Compression problem, Maximum Asymmetric TSP problem, the (1, 2)–ATSP problem, the (1, 2)–TSP problem, the (1, 4)–ATSP problem and the (1, 4)–TSP problem improving on the best up to now known approximation lower bounds for those problems.
متن کاملThe power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings
The Maximum Asymmetric Travelling Salesman Problem (Max-ATSP), which asks for a Hamiltonian path of maximum weight covering a digraph, and the Maximum Compression (Max-COMP), which, for a finite language P := {s1, . . . ,sp}, asks for w, a superstring of P minimising ∑si∈S |si|− |w|, are both difficult to approximate (Max-SNP hard). Solving Max-ATSP on the overlap graph of the words of P solves...
متن کامل1 2 O ct 2 00 6 Approximation Algorithms for Multi - criteria Traveling Salesman Problems ∗
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کامل